Minimizing Aggregate Movements for Interval Coverage

نویسندگان

  • Aaron M. Andrews
  • Minghui Jiang
  • Mark R. McLellan
  • Haitao Wang
چکیده

Minimizing Aggregate Movements for Interval Coverage

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extracting Aggregate Answer Statistics for Integration

Aggregate queries in integration contexts often do not have one “true” answer; there can be multiple correct answers for the same aggregate query. This is due to the existence of duplicate or overlapping data points, possibly with di↵erent values, across the data sources. Depending on the choice of data source combinations that are used to answer the query, di↵erent answers can be generated. Th...

متن کامل

Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean

 ‎A Poisson distribution is well used as a standard model for analyzing count data‎. ‎So the Poisson distribution parameter estimation is widely applied in practice‎. ‎Providing accurate confidence intervals for the discrete distribution parameters is very difficult‎. ‎So far‎, ‎many asymptotic confidence intervals for the mean of Poisson distribution is provided‎. ‎It is known that the coverag...

متن کامل

A Comprehensive Fuzzy Multiobjective Supplier Selection Model under Price Brakes and Using Interval Comparison Matrices

The research on supplier selection is abundant and the works usually only consider the critical success factors in the buyer–supplier relationship. However, the negative aspects of the buyer–supplier relationship must also be considered simultaneously. In this paper we propose a comprehensive model for ranking an arbitrary number of suppliers, selecting a number of them and allocating a quota o...

متن کامل

Minimizing the Maximum Moving Cost of Interval Coverage

In this paper, we consider an interval coverage problem. We are given n intervals of the same length on a line L and a line segment B on L. Each interval has a nonnegative weight. The goal is to move the intervals along L such that every point of B is covered by at least one interval and the maximum moving cost of all intervals is minimized, where the moving cost of each interval is its moving ...

متن کامل

Preemptive Possibilistic Linear Programming:Application to Aggregate Production Planning

This research proposes a Preemptive Possibilistic Linear Programming (PPLP) approach for solving multiobjective Aggregate Production Planning (APP) problem with interval demand and imprecise unit price and related operating costs. The proposed approach attempts to maximize profit and minimize changes of workforce. It transforms the total profit objective that has imprecise information to three ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014